6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable
نویسندگان
چکیده
منابع مشابه
NORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملCayley graphs of order 30p are Hamiltonian
Correspondence should be addressed to Dave Witte Morris, [email protected] Received 22 January 2011; Accepted 18 April 2011 Academic Editor: Cai Heng Li Copyright q 2011 E. Ghaderpour and D. W. Morris. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original w...
متن کاملHamilton decompositions of 6-regular Cayley graphs on even Abelian groups with involution-free connections sets
Alspach conjectured that every connected Cayley graph on a finite Abelian group A is Hamiltondecomposable. Liu has shown that for |A| even, if S = {s1, . . . , sk} ⊂ A is an inverse-free strongly minimal generating set of A, then the Cayley graph Cay(A;S?), is decomposable into k Hamilton cycles, where S? denotes the inverse-closure of S. Extending these techniques and restricting to the 6-regu...
متن کاملFlows that are sums of hamiltonian cycles in Cayley graphs on abelian groups
If X is any connected Cayley graph on any finite abelian group, we determine precisely which flows on X can be written as a sum of hamiltonian cycles. (This answers a question of B. Alspach.) In particular, if the degree of X is at least 5, and X has an even number of vertices, then the flows that can be so written are precisely the even flows, that is, the flows f , such that ∑ α∈E(X) f(α) is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.03.043